On proving syntactic properties of CPS programs

Higher-order program transformations raise new challenges for proving properties of their output, since they resist traditional, first-order proof techniques. In this work, we consider (1) the “one-pass” continuationpassing style (CPS) transformation, which is second-order, and (2) the occurrences of parameters of continuations in its output. To this end, we specify the one-pass CPS transformation relationally and we use the proof technique of logical relations. ∗To be presented at HOOTS99, Paris, France, September 30-October 1, 1999 (http://www.cl.cam.ac.uk/ ̃ap/hoots) †Basic Research in Computer Science (http://www.brics.dk), Centre of the Danish National Research Foundation. ‡Building 540, Ny Munkegade, DK-8000 Aarhus C, Denmark. E-mail: {danvy,belmina}@brics.dk §5000 Forbes Ave., Pittsburgh, PA 15213-3891, USA. E-mail: [email protected] This work is supported by NSF Grant CCR-9303383.